Decoupling the CGAL 3D Triangulations from the Underlying Space
نویسندگان
چکیده
The Computational Geometry Algorithms Library Cgal currently provides packages to compute triangulations in R and R. In this paper we describe a new design for the 3D triangulation package that permits to easily add functionality to compute triangulations in other spaces. These design changes have been implemented, and validated on the case of the periodic space T. We give a detailed description of the realized changes together with their motivation. Finally, we show benchmarks to prove that the new design does not a ect the e ciency. Key-words: Triangulation, Tetrahedrization, Torus, Periodic space ∗ INRIA Sophia-Antipolis ([email protected]). † Nico Kruithof worked on this during his stay at INRIA Sophia-Antipolis ([email protected]). Découplage des triangulations 3D de CGAL de l'espace sous-jacent Résumé : La bibliothèque Cgal (Computational Geometry Algorithms Library) fournit actuellement des modules de calcul de triangulations dans R et R. Nous décrivons ici une nouvelle architecture pour le module de triangulations 3D, qui permet d'ajouter facilement les fonctionnalités nécessaires au calcul de triangulations dans d'autres espaces. Ces changements d'architecture ont été implantés, et validés sur le cas de l'espace périodique T. Nous donnons une description détaillée des changements réalisés ainsi que de leur motivation. Finalement, nous présentons des mesures expérimentales prouvant que la nouvelle architecture n'a ecte pas l'e cacité du code. Mots-clés : Triangulation, Tore, Espace périodique Decoupling Triangulations from Space 3
منابع مشابه
3D kinetic alpha complexes and their implementation
Motivated by an application in cell biology, we describe an extension of the kinetic data structures framework from Delaunay triangulations to fixed-radius alpha complexes. Our algorithm is implemented using CGAL, following the exact geometric computation paradigm. We report on several techniques to accelerate the computation that turn our implementation applicable to the underlying biological ...
متن کاملParallel Multi-Core Geometric Algorithms in CGAL
We describe an approach to efficiently use multiple processing cores and shared memory for several geometric algorithms. The d-dimensional algorithms we target are (a) spatial sorting of points, (b) kd-tree construction, (c) axis-aligned box intersection computation, and finally (d) bulk insertion of points in Delaunay triangulations. Underlying these comes also a thread-safe, efficient and mem...
متن کاملTriangulations in CGAL
This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library Cgal.
متن کاملSmoothed complexityof geometric structures and algorithms
Geometric problems are central in many areas of science and engineering. Computational geometry, the study of combinatorial and algorithmic problems in a geometric setting, and in particular triangulations have tremendous practical applications in areas such as computer graphics, computer vision and imaging, scientific visualization, geographic information systems, astronomy, computational biol...
متن کاملInternship proposal Walking in triangulation , probabilistic analysis
Geometric problems are central in many areas of science and engineering. Computational geometry, the study of combinatorial and algorithmic problems in a geometric setting, and in particular triangulations have tremendous practical applications in areas such as computer graphics, computer vision and imaging, scientific visualization, geographic information systems, astronomy, computational biol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008